Price of Anarchy⋆

نویسنده

  • Mohammad Ali Safari
چکیده

Internet users, auction bidders, and stock buyers are examples of agents who are selfishly trying to maximize their own benefit without necessarily caring the global objective of the underlying game such as the overall load on the network or the overall satisfaction of agents. How does these two points of view (agents vs. global) correlate? How much does the society suffer by the lack of coordination between players? The optimal social utility function happens when we have a single authority who dictates every agent what to do. In contrast, when agents choose their own action, we should study their behavior and compare the obtained social utility with the optimal one. There are currently two main approaches for studying behavior of agents. Koutsoupias and Papadimitriou [KP99] assume that agents play according to a Nash equilibrium; thus they, pessimistically, consider the Nash equilibrium that gives the worst social utility and compare it with the optimal social utility. In contrast, Goemans et al. [GMV05] consider games in which agents are reluctant to choose mixed strategies and repeatedly choose their action by playing their best pure responses even if there is no pure strategy Nash equilibrium in the game. In this note we review these two different approaches: price of anarchy and price of sinking. In section 2 we survey some results related to the price of anarchy. In particular, we discuss previous researches on unsplittable flow problem, congestion games, and a class of games, called valid utility systems, whose price of anarchy is constant. Then, in Section 3, we introduce the price of sinking and its value on unsplittable routing games, congestion games, and valid utility systems. The two approaches, price of sinking and price of anarchy, are compared at the end.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Price of Stochastic Anarchy

We consider the solution concept of stochastic stability, and propose the price of stochastic anarchy as an alternative to the price of (Nash) anarchy for quantifying the cost of selfishness and lack of coordination in games. As a solution concept, the Nash equilibrium has disadvantages that the set of stochastically stable states of a game avoid: unlike Nash equilibria, stochastically stable s...

متن کامل

Local and global price of anarchy of graphical games

This paper initiates a study of connections between local and global properties of graphical games. Specifically, we introduce a concept of local price of anarchy that quantifies how well subsets of agents respond to their environments. We then show several methods of bounding the global price of anarchy of a game in terms of the local price of anarchy. All our bounds are essentially tight.

متن کامل

The Local and Global Price of Anarchy of Graphical Games

This paper initiates a study of connections between local and global properties of graphical games. Specifically, we introduce a concept of local price of anarchy that quantifies how well subsets of agents respond to their environments. We then show several methods of bounding the global price of anarchy of a game in terms of the local price of anarchy. All our bounds are essentially tight.

متن کامل

Design Trade-offs in Concave Cost Sharing Games

This paper focuses on the design of cost sharing rules to optimize the efficiency of the resulting equilibria in cost sharing games with concave cost functions. Our analysis focuses on two well-studied measures of efficiency, termed the price of anarchy and price of stability, which provide worstcase guarantees on the performance of the (worst or best) equilibria. Our first result characterizes...

متن کامل

Strong Price of Anarchy and Coalitional Dynamics

We introduce a framework for studying the effect of cooperation on the quality of outcomes in utility games. Our framework is a coalitional analog of the smoothness framework of noncooperative games. Coalitional smoothness implies bounds on the strong price of anarchy, the loss of quality of coalitionally stable outcomes, as well as bounds on coalitional versions of coarse correlated equilibria...

متن کامل

Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of Anarchy

We consider the well-studied game-theoretic version of machine scheduling in which jobs correspond to self-interested users and machines correspond to resources. Here each user chooses a machine trying to minimize her own cost, and such selfish behavior typically results in some equilibrium which is not globally optimal : An equilibrium is an allocation where no user can reduce her own cost by ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005